peeling algorithm

peeling algorithm: French\ \ algorithme d'épluchage

German\ \ Schalenalgorithmus

Dutch\ \ schil algoritme

Italian\ \ procedura della sbucciatura

Spanish\ \ algoritmo de la peladura

Catalan\ \ algorisme d'escorçament

Portuguese\ \ algoritmo de descascamento

Romanian\ \ -

Danish\ \ -

Norwegian\ \ -

Swedish\ \ -

Greek\ \ αλγόριθμος αποφλοίωσης

Finnish\ \ (kuorinta-algoritmi)

Hungarian\ \ -

Turkish\ \ kabuk-soyma algoritması

Estonian\ \ -

Lithuanian\ \ -

Slovenian\ \ -

Polish\ \ -

Russian\ \ алгоритм очищения

Ukrainian\ \ -

Serbian\ \ -

Icelandic\ \ flögnun reiknirit

Euskara\ \ algoritmoa zuritu

Farsi\ \ -

Persian-Farsi\ \ -

Arabic\ \ خوارزمية التقشير

Afrikaans\ \ afskillingsalgoritme

Chinese\ \ -

Korean\ \ 껍질벗기기 알고리즘

Игры ⚽ Поможем написать курсовую

Look at other dictionaries:

Felsenstein's Tree Peeling Algorithm — Felsenstein s Tree Peeling Algorithm, due to Joseph Felsenstein is an algorithm for computing the likelihood of a coalescent tree from a set of genotypes … Wikipedia
Bitrate peeling — is a technique used in Ogg Vorbis audio encoded streams, wherein a stream can be encoded at one bitrate but can be served at that or any lower bitrate.Bitrate Peeling is similar in overall effect to Real Networks technology called SureStream ,… … Wikipedia
Joseph Felsenstein — Joseph Joe Felsenstein is Professor in the Departments of Genome Sciences and Biology and Adjunct Professor in the Departments of Computer Science and Statistics at the University of Washington in Seattle. He is best known for his work on… … Wikipedia
Vorbis — This article is about the audio compression codec. For the Discworld character, see Discworld characters. Vorbis Xiph.org Logo Filename extension .ogg .oga … Wikipedia
Degeneracy (graph theory) — In graph theory, a k degenerate graph is an undirected graph in which every subgraph has a vertex of degree at most k: that is, some vertex in the subgraph touches k or fewer of the subgraph s edges. The degeneracy of a graph is the smallest… … Wikipedia
Cron — is a time based scheduling service in Unix like computer operating systems. cron is short for chronograph . [ [http://drupal.org/node/937#cron Drupal Terminology Page] ] cron has been recreated several times in its history. Design cron is driven… … Wikipedia
Deferred shading — Diffuse Color G Buffer Z Buffer … Wikipedia
Frameworks supporting the polyhedral model — Use of the polyhedral model within a compiler requires software to represent the objects of this framework (sets of integer valued points in regions of various spaces) and perform operations upon them (e.g., testing whether the set is empty). Two … Wikipedia
Список известных учёных-релятивистов — Это служебный список статей, созданный для координации работ по развитию темы. Данное предупреждение не ус … Википедия
cron — For other uses, see CRON (disambiguation). Cron is a time based job scheduler in Unix like computer operating systems. Cron enables users to schedule jobs (commands or shell scripts) to run periodically at certain times or dates. It is commonly… … Wikipedia
Compiler optimization — is the process of tuning the output of a compiler to minimize or maximize some attributes of an executable computer program. The most common requirement is to minimize the time taken to execute a program; a less common one is to minimize the… … Wikipedia

Academic Dictionaries and Encyclopedias

peeling algorithm

Look at other dictionaries:

Share the article and excerpts

Academic Dictionaries and Encyclopedias

Statistical terms

peeling algorithm

Look at other dictionaries:

Share the article and excerpts

Direct link